搜索资源列表
RBFS_CODE
- RBFS算法（递归最佳优先搜索：A*家族）和LRTA*算法（联机局部搜索，又名实时学习A*搜索，同为A*家族）实现图的单源最短路径。其中RBFS和LRTA*算法均比狄杰算法效率高！ -RBFS algorithm (recursive best first search : * A family) and the LRTA * algorithm (online local search, also known as real-time learning A * search, with t
updatesimplexmethod
- 单纯形法是一种不错的随机搜索算法，但是其受初始值的选取，步长大小的影响较大，容易陷入局部收敛。程序中列出了基本单纯形法，和几种改进的单纯形法，包括变步长的单纯形法，单纯形加遗传算法等。-simplex method is a good random search algorithm, but its initial value by the selection, step in a larger size, easy to be trapped into local convergence. P
ZDT4
- 为了有效地应用遗传算法解决 鲁棒控制系统设计问题，将遗传算法与局部优化方法相结合，提出了基于降维扫描方法的自适应多目标遗传算法（DRSA-MOGA）。通过引入适应度函数标准化方法、基于最优Pareto解集搜索的降维扫描方法和适应度函数自适应调整方法，提高了算法的全局优化性能和局部搜索能力。仿真结果表明，DRSA-MOGA算法在不损失解的均匀度的情况下可以达到很高的逼近度
Nqueenproblem
- 这个程序采用局部搜索算法（Local Search），速度很快， 在配置为奔腾200，内存64MB,上测试可以在 几秒钟内解一百万阶的皇后问题。-This procedure using a local search algorithm (Local Search), fast, in the configuration for the Pentium 200, RAM 64MB, the test solution in a few seconds of order 1 million
dpso
- 离散微粒群优化算法解决流水线调度问题。包含多个有名算法：NEH，局部搜索算法等。-Discrete Particle Swarm Optimization algorithm to solve assembly line scheduling problem. Contains several well-known algorithms: NEH, local search algorithm.
simulated-anealing
- 模拟退火算法是局部搜索算法的扩展，以一定的概率选择领域中费用值大的状态-Simulated annealing algorithm is an extension of local search algorithm to choose a certain probability value of large areas of the state fee
GSOaHGSO(matlab)
- GSO算法及其改进，其中HGSO是通过与和声搜索算法结合而成，主要用于结构的截面优化、几何优化、动力优化、拓扑优化等，具有收敛速度快，收敛结果好的优点，且其改进算法能摆脱局部最优的缺陷。-GSO algorithm and its improvements, HGSO is through a combination of harmony search algorithm, mainly used to optimize the structure of the cross section, g
Hybrid-ES-Program
- 针对港口拖轮调度所设计的遗传混合局部搜索算法代码，优化拖轮调度方案，matlab语言编写-Port tugboats are designed for scheduling the genetic code hybrided with local search algorithm to optimize the scheduling program,written by Matlab
NQueens
- N-皇后问题的快速局部搜索算法,参考：Rok Sosic and Jun Gu. A Polynomial Time Algorithm for the N-Queens Problem. SIGART Bulletin, 1(3):7-11, 1990.-n queens
LSset
- 10余种局部搜索算法，包含了大量近年来局部搜索算法的研究-10 kinds of local search algorithms, including a large number of studies in recent years, local search algorithm
66334
- 实现视觉光流场计算 其中采用了全局和局部搜索算法的结合 调试过无错误-optical flow code
NQueens
- 利用快速局部搜索算法，在几秒内解决百万皇后问题-solve the million queens problem in just a few secs.
easylocal-2
- EasyLocal++ : 这是一个C++面向对象的框架 方便开发局部搜索算法~-EasyLocal++: a C++ Object-Oriented framework aimed at easing the development of Local Search algorithms.
NQueens
- nqueens 问题的QS1实现 N-皇后问题的快速局部搜索算法 1分钟可以找到75000皇后的一个解 参考：Rok Sosic and Jun Gu. A Polynomial Time Algorithm for the N-Queens Problem. SIGART Bulletin, 1(3):7-11, 1990.-Fast Local Search Algorithm QS1 nqueens problem realization // // N- Queens pro
beibao
- 模拟退火算法是一种通用的随机搜索算法，是对局部搜索算法的扩展。与一般局部搜索算法不同，SA以一定的概率选择领域中目标值相对较小的状态，是一种理论上的全局最优算法。-Simulated annealing algorithm is a common random search algorithm is an extension of local search algorithm. Different general local search algorithm, SA with a certain
TS
- 禁忌搜索算法源代码，对局部邻域搜索的一种扩展，搜索过程中采用禁忌准则，即不考虑处于禁忌状态的解，标记对应已搜索的局部最优解的一些对象，在进一步迭代搜索中尽量避开这些对象，避免迂回搜索，从而保证对不同的有效搜索途径的检索，是一种局部极小突跳的全局逐步寻优算法。(Tabu search algorithm source code, an extension of the local neighborhood search criteria, using tabu search process, th
cuckoo_search
- 通过布谷鸟算法实现局部搜索和全局搜索，得到最优(Local search and global search are achieved, and the optimal results are obtained)
算法
- floyd算法又称为插点法，是一种利用动态规划的思想寻找给定的加权图中多源点之间最短路径的算法，模拟退火算法是局部最优解能概率性地跳出并最终趋于全局最优，遗传算法是一种通过模拟自然进化过程搜索最优解的方法。(The Floyd algorithm is also known as the insertion point method, which is a multi weighted graph using the idea of dynamic programming for the giv
KGMES469
- 用经典的局部搜索算法模拟退火算法求解一个图的最大可平面子图,()
asd
- 非线性规划算法局部搜索能力较强，全局搜索能力较弱，遗传算法局部搜索能力较弱，全局搜索能力较强，结合两者优点得到最优解(Nonlinear programming algorithm has strong local search ability, weak global search ability, weak local search ability of genetic algorithm, and strong global search ability. The best solutio